Stability , Sequentiality and DemandDriven Evaluation in Data

نویسندگان

  • Arnon Avron
  • Nada Sasson
چکیده

We show that a given dataaow language l has the property that for any program P and any demand for outputs D (which can be satissed) there exists a least partial computation of P which satisses D, ii all the operators of l are stable. This minimal computation is the demand-driven evaluation of P. We also argue that in order to actually implement this mode of evaluation, the operators of l should be further restricted to be eeectively sequential ones.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Strong Stability and Higher-Order Sequentiality

We propose a deenition by reducibility of sequentiality for the interpretations of higher-order programs and prove the equivalence between this notion and strong stability.

متن کامل

Recovering Sequentiality in Functional-Logic Programs

EEcient code generation in implementations of functional logic languages relies on the sequentiality of the program rules | existence of an optimal evaluation order for arguments. Parallel evaluation of arguments in the presence of free variables is out of the question due to the possibility of backtracking and sharing of these variables among diierent arguments. In this paper we show that the ...

متن کامل

Sequentiality, Second Order Monadic Logic and Tree Automata

Given a term rewriting system R and a normalizable term t, a redex is needed if in any reduction sequence of t to a normal form, this redex will be contracted. Roughly, R is sequential if there is an optimal reduction strategy in which only needed redexes are contracted. More generally, G. Huet and J.-J. L evy deene in 9] the sequentiality of a predicate P on partially evaluated terms. We show ...

متن کامل

A Refinement of Strong Sequentiality for Term Rewriting with Constructors

The notion of call-by-need evaluation has turned out to be very fruitful when applied to dialects of the i-calculus (Henderson and Morris, 1976, in “Proc. 3rd ACM Symp. on the Principles of Programming Languages, Atlanta; Kahn and Mac Queen, 1977, in “IFIP 77,” North-Holland, Amsterdam; Turner, 1979, Software Practice and Experience, Vol. 9; Vuillemin, 1974, J. Cornput. System3 .Sci. 9, 332-354...

متن کامل

A Stability-based On-demand Multicast Routing

Multicast communication in the context of ad hoc wireless network is a very useful and efficient means of supporting group-oriented applications, where the need for one-to-many data dissemination is quite frequent in critical situations such as disaster recovery or battlefield scenarios. The objective of this paper is to propose and evaluate an on-demand multicasting routing mechanism for ad ho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001